The HOL Logic Extended with Quantification over Type Variables
نویسنده
چکیده
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantification over types. It is shown how certain practical problems with using the definitional mechanisms of HOL would be solved by the additional expressive power gained by making this extension.
منابع مشابه
The Hol Logic Extended with Quantiication over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantiication over types. It is shown how certain practical problems with using the deenitional mechanisms of HOL would be solved by the additional expressive power g...
متن کاملParametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials over another set of variables, we call parameters. The procedure generalizes Ferrante and Rackoff’s algorithm for the non-parametric case. The formalization is based on axiomatic type classes and automatically carries ...
متن کاملHoare Logic for NanoJava: Auxiliary Variables, Side Effects, and Virtual Methods Revisited
We define NanoJava, a kernel of Java tailored to the investigation of Hoare logics. We then introduce a Hoare logic for this language featuring an elegant approach for expressing auxiliary variables: by universal quantification on the outer logical level. Furthermore, we give simple means of handling side-effecting expressions and dynamic binding within method calls. The logic is proved sound a...
متن کاملQuantified Conditional Logics are Fragments of HOL
A semantic embedding of propositional conditional logic in classical higher-order logic HOL (Church’s type theory) has been presented in [3]. This embedding exploits the natural correspondence between selection function semantics for conditional logics [10] and HOL. In fact, selection function semantics can be seen as an higher-order extension of well-known Kripke semantics for modal logic and ...
متن کاملHOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term operations for type abstraction and type application. The formation of type application terms t [T ] is restricted to small types T that do not contain any universal types. This constraint ensures the existence of a set-theoreti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Formal Methods in System Design
دوره 3 شماره
صفحات -
تاریخ انتشار 1992